Search results for "FORMATION [STARS]"
showing 10 items of 9034 documents
Latvia. Human Development Report 2010/2011: National identity, Mobility and Capability
2011
The 2010/2011 report was produced under the auspices of the national research programme „National Identity”. The job of the report is to survey the content of individual national belonging in the context of human development. The report particularly focuses on emigration issues, because human development is weakened by a reduction in the size of the country’s population. The fact that people are moving to other countries shows that there is an endless competition among identities, as well as a transformation of those identities. The report also reveals the set of circumstances and techniques (the ability to act) which facilitate links between an individual and a location or region. The firs…
Utopies et medias de masse
2019
International audience; Toute technologie est portée, au moins à ses débuts, par un imaginaire.Utopies et médias de masse traite des courants utopiques qui ont cherché à considérer les médias de masse comme un levier pour une société meilleure. La perspective adoptée est à la fois historique, sociétale et éducationnelle. Elle permet d’expliquer ces courants, de les situer dans leur contexte mais aussi de saisir l’influence qu’ils ont pu avoir. Si cet ouvrage jette parfois un regard rétrospectif sur le XIXe siècle ou plus loin dans le passé, il couvre principalement le XIXe siècle. Il examine également les conditions d’une éducation aux médias de masse au XXIe siècle.L’ouvrage s’adresse aux …
Variable time amplitude amplification and quantum algorithms for linear algebra problems
2012
Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …
Discrete spectral incoherent solitons in nonlinear media with noninstantaneous response
2011
International audience; We show theoretically that nonlinear optical media characterized by a finite response time may support the existence of discrete spectral incoherent solitons. The structure of the soliton consists of three incoherent spectral bands that propagate in frequency space toward the low-frequency components in a discrete fashion and with a constant velocity. Discrete spectral incoherent solitons do not exhibit a confinement in the space-time domain, but exclusively in the frequency domain. The kinetic theory describes in detail all the essential properties of discrete spectral incoherent solitons: A quantitative agreement has been obtained between simulations of the kinetic…
On Whitham and Related Equations
2017
The aim of this paper is to study, via theoretical analysis and numerical simulations, the dynamics of Whitham and related equations. In particular, we establish rigorous bounds between solutions of the Whitham and Korteweg–de Vries equations and provide some insights into the dynamics of the Whitham equation in different regimes, some of them being outside the range of validity of the Whitham equation as a water waves model.
Efficient generation of restricted growth words
2013
A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.
Adjacency matrices of random digraphs: singularity and anti-concentration
2017
Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …
Restricted compositions and permutations: from old to new Gray codes
2011
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…
Statistics-preserving bijections between classical and cyclic permutations
2012
Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…
Promotion et Développement d'un Master Erasmus Mundus - L'Exemple du VIBOT
2011
Cet article decrit l’offre de formation a l’internationale proposee au Centre Universitaire Condorcet du Creusot (Universite de Bourgogne) dans le domaine de la vision par ordinateur et de la robotique. Il presente l’organisation particuliere de ces formations et les actions de support mises en place pour en assurer la perennite.